Stochastic approximation algorithms for partition function estimation of Gibbs random fields
نویسندگان
چکیده
منابع مشابه
Stochastic approximation algorithms for partition function estimation of Gibbs random fields
We present an analysis of recently proposed Monte Carlo algorithms for estimating the partition function of a Gibbs random field. We show that this problem reduces to estimating one or more expectations of suitable functionals of the Gibbs states with respect to properly chosen Gibbs distributions. As expected, the resulting estimators are consistent. Certain generalizations are also provided. ...
متن کاملA Faster Approximation Algorithm for the Gibbs Partition Function
We consider the problem of estimating the partition function Z(β) = ∑ x exp(−β(H(x)) of a Gibbs distribution with a Hamilton H(·), or more precisely the logarithm of the ratio q = lnZ(0)/Z(β). It has been recently shown how to approximate q with high probability assuming the existence of an oracle that produces samples from the Gibbs distribution for a given parameter value in [0, β]. The curre...
متن کاملOn a Parameter Estimation Method for Gibbs-Markov Random Fields
Fig. 2. space by Patrick-Fisher's algorithm (solid line) and E (dotted line). Bayes error estimates for SONAR data transformed to IO-dimensional high-dimensional data these results might be more in favor of E.) This is a result of the fact that each iteration of simplex requires that the samples be transformed to the low-dimensional space, and then the Bayes error estimated in that space, which...
متن کاملOn Stochastic Estimation of Partition Function
In this paper, we show analytically that the duality of normal factor graphs (NFG) can facilitate stochastic estimation of partition functions. In particular, our analysis suggests that for the q−ary two-dimensional nearest-neighbor Potts model, sampling from the primal NFG of the model and sampling from its dual exhibit opposite behaviours with respect to the temperature of the model. For high...
متن کاملA Deterministic Partition Function Approximation for Exponential Random Graph Models
Exponential Random Graphs Models (ERGM) are common, simple statistical models for social network and other network structures. Unfortunately, inference and learning with them is hard even for small networks because their partition functions are intractable for precise computation. In this paper, we introduce a new quadratic time deterministic approximation to these partition functions. Our main...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1997
ISSN: 0018-9448
DOI: 10.1109/18.641558